Extension of ISOMAP for Imperfect Manifolds
نویسندگان
چکیده
As one of the most promising nonlinear dimensionality reduction techniques, Isometric Mapping (ISOMAP) performs well only when the data belong to a single well-sampled manifold, where geodesic distances can be well approximated by the corresponding shortest path distances in a suitable neighborhood graph. Unfortunately, the approximation gets less and less precise generally as the number of edges of the corresponding shortest path increases, which makes ISOMAP tend to overlap or overcluster the data, especially for disjoint or imperfect manifolds. To alleviate this problem, this paper presented a variant of ISOMAP, i.e. Edge Number-based ISOMAP (ENISOMAP), which uses a new variant of Multidimensional Scaling (MDS), i.e. Edge Number-based Multidimensional Scaling (EN-MDS), instead of the classical Multidimensional Scaling (CMDS) to map the data into the low-dimensional embedding space. As a nonlinear variant of MDS, ENMDS gives larger weight to the distances with fewer edges, which are generally better approximated and then more trustworthy than those with more edges, and thus can preserve the more trustworthy distances more precisely. Finally, experimental results verify that not only imperfect manifolds but also intrinsically curved manifold can be visualized by EN-ISOMAP well.
منابع مشابه
An Automatic and Adaptive Multi-manifolds Learning Algorithm
Isomap is a classic and representative manifold learning algorithm for nonlinear dimensionality reduction, which aims to circumvent the problem of “the curse of dimensionality” and attempts to recover the intrinsic structure hidden in high-dimensional data based on the assumption that data lie in or near a single manifold. However, Isomap fails to work when data set consists of multi-clusters o...
متن کاملIsometric Multi-Manifolds Learning
Isometric feature mapping (Isomap) is a promising manifold learning method. However, Isomap fails to work on data which distribute on clusters in a single manifold or manifolds. Many works have been done on extending Isomap to multi-manifolds learning. In this paper, we proposed a new multi-manifolds learning algorithm (M-Isomap) with the help of a general procedure. The new algorithm preserves...
متن کاملAngle constrained path to cluster multiple manifolds
In this paper, we propose a method to cluster multiple intersected manifolds. The algorithm chooses several landmark nodes randomly and then checks whether there is an angle-constrained path between each landmark node and every other node in the neighborhood graph. When the points lie on different manifolds with intersection they should not be connected using a smooth path, thus the angle const...
متن کاملNon-linear Dimensionality Reduction by Locally Linear Isomaps
Algorithms for nonlinear dimensionality reduction (NLDR) find meaningful hidden low-dimensional structures in a high-dimensional space. Current algorithms for NLDR are Isomaps, Local Linear Embedding and Laplacian Eigenmaps. Isomaps are able to reliably recover lowdimensional nonlinear structures in high-dimensional data sets, but suffer from the problem of short-circuiting, which occurs when t...
متن کاملARTÍCULO ISOMAP based metrics for clustering
Many successful clustering techniques fail to handle data with a manifold structure, i.e. data that is not shaped in the form of compact point clouds, forming arbitrary shapes or paths through a high-dimensional space. In this paper we present a new method to evaluate distances in such spaces that naturally extend the application of many clustering algorithms to these cases. Our algorithm has t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JCP
دوره 7 شماره
صفحات -
تاریخ انتشار 2012